Robust vector quantization for channels with memory
نویسندگان
چکیده
This study focuses on two issues: parametric modeling of the channel and index assignment of codevectors, to design a vector quantizer that achieves high robustness against channel errors. We first formulated the design of a robust zero-redundancy vector quantizer as a combinatorial optimization problem leading to a genetic search for the minimum distortion index assignment. This study also presents an index assignment algorithm based on Gilbert's model with parameter values estimated using a real-coded genetic algorithm. Simulation results indicate that the global explorative properties of genetic algorithms make them very effective at estimating Gilbert's model parameters and by using this model the index assignment can be developed to respond to channel conditions.
منابع مشابه
کاهش رنگ تصاویر با شبکههای عصبی خودسامانده چندمرحلهای و ویژگیهای افزونه
Reducing the number of colors in an image while preserving its quality, is of importance in many applications such as image analysis and compression. It also decreases memory and transmission bandwidth requirements. Moreover, classification of image colors is applicable in image segmentation and object detection and separation, as well as producing pseudo-color images. In this paper, the Kohene...
متن کاملA Method to Reduce Effects of Packet Loss in Video Streaming Using Multiple Description Coding
Multiple description (MD) coding has evolved as a promising technique for promoting error resiliency of multimedia system in real-time application programs over error-prone communicational channels. Although multiple description lattice vector quantization (MDCLVQ) is an efficient method for transmitting reliable data in the context of potential error channels, this method doesn’t consider disc...
متن کاملSoft Decoding for Vector Quantization Over Noisy Channels with Memory
We provide a general treatment of optimal soft decoding for vector quantization over noisy channels with nite memory. The main result is a recursive implementation of optimal decoding. We also consider an approach to sub-optimal decoding, of lower complexity, being based on a generalization of the Viterbi algorithm. Finally we treat the problem of combined encoder{decoder design. Simulations co...
متن کاملThe Time Adaptive Self Organizing Map for Distribution Estimation
The feature map represented by the set of weight vectors of the basic SOM (Self-Organizing Map) provides a good approximation to the input space from which the sample vectors come. But the timedecreasing learning rate and neighborhood function of the basic SOM algorithm reduce its capability to adapt weights for a varied environment. In dealing with non-stationary input distributions and changi...
متن کاملIndex assignment in vector quantisation for channels with memory - Vision, Image and Signal Processing, IEE Proceedings-
The study prcsents a formulation of a Hadaniard framework for analysing the vector quantisation aver channels with memory. In seeking faster response, classes of index assignments are defined in terms of the Hadamard transform of channel transition probabilities, An index assignment algorithm is developed that achieves high robustness against channel errors, and its performance i n vector quant...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999